Fault-tolerant Genuine Atomic Multicast

We present a very simple fault-tolerant atomic multicast algorithm. We suppose that we have disjoint process groups such that in each group we can realize the consensus. It is the case, for example, if, in each group, there is a majority of correct processes and if we dispose of a failure detector in 3S. This algorithm is genuine, that is, only the sender and the processes in destination groups are involved in the algorithm. Moreover, this algorithm minimizes the number of consensus to realize atomic multicast: only one consensus (inside groups) in each destination groups is needed.